Improved Sparse Correspondence Resolution Using Loopy Belief Propagation with Mrf Clique Based Structure Preservation
نویسندگان
چکیده
In this paper we develop a novel MRF formulation for calculating sparse features correspondence in image pairs. Our MRF terms can include cliques of variable sizes, and solve these using Loopy Belief Propagation. To calculate our MRF topology we develop a variant of the K-means algorithm which we call the KN-means algorithm (where each mean has a specified number of neighbours). The method is compared to other state of the art sparse feature correspondence algorithms and shown to compare well, especially for less dense feature sets. Outliers are handled naturally within this paradigm.
منابع مشابه
Accelerated Sparse Feature Correspondence Resolution Using Loopy Belief Propagation with Mrf Clique Based Structure Preservation
In this paper we extend the work of (Louw and Nicolls, 2007) which proposed a novel Markov Random Field formulation for resolving sparse features correspondences in image pairs. The MRF terms can include cliques of variable sizes, and the energies are minimized using Loopy Belief Propagation. In this paper, an improved MRF topology is developed which uses a variant of the previously developed K...
متن کاملRecognition of Hand-drawn Sketches with Marcov Random Fields
Freehand sketches are complex for recognition. Individual fragments of the drawing are often ambiguous to be interpreted without contextual cues. Markov Random Field (MRF) that ends up with a global model by simply specifying local interactions can naturally suffice the requirement. In our project, a recognizer based on MRF has been constructed to jointly analyze local features in order to inco...
متن کاملA New Spatio-Temporal MRF Framework for Video-based Object Segmentation
In this paper we propose a general framework for videobased object segmentation using a new spatio-temporal Markov Random Field (MRF) model. Video-based object segmentation has the potential to improve the performance of static image segmentation by fusing information over the temporal scale. Built upon a spatio-temporal MRF model, our method offers three advantages in a unified framework. Firs...
متن کاملFractional Belief Propagation
We consider loopy belief propagation for approximate inference in probabilistic graphical models. A limitation of the standard algorithm is that clique marginals are computed as if there were no loops in the graph. To overcome this limitation, we introduce fractional belief propagation. Fractional belief propagation is formulated in terms of a family of approximate free energies, which includes...
متن کاملBelief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs
We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph...
متن کامل